Effective heuristics for solving dynamic variant of single processor total tardiness problems

Scheduling a variant of flowshop problems to minimize total tardiness

This paper studies no-wait flowshop scheduling problems to minimize total tardiness. This paper mathematically formulates the problem as an effective mixed integer linear programming model. Moreover, this paper proposes solution methods based on variable neighborhood search and simulated annealing algorithms. Besides, some well-known heuristics of classical flow shops are adapted to the case of...

Algorithms for Special Single Machine Total Tardiness Problems

The scheduling problem of minimizing total tardiness on a single machine is known to be NP -hard in the ordinary sense. In this paper, we consider the special case of the problem when the processing times pj and the due dates dj of the jobs j, j ∈ N = {1, 2, . . . , n}, are oppositely ordered: p1 ≥ p2 ≥ . . . ≥ pn and d1 ≤ d2 ≤ . . . ≤ dn. It is shown that already this special case is NP -hard ...

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

This paper presents several local search heuristics for the problem of scheduling a single machine to minimize total weighted tardiness. We introduce a new binary encoding scheme to represent solutions, together with a heuristic to decode the binary representations into actual sequences. This binary encoding scheme is compared to the usual 'natural' permutation representation for descent, simul...

Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs

W e consider multimachine scheduling problems with earliness and tardiness costs. We first analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive duedate, and the objective is to minimize the sum of the costs incurred for all N jobs. (A special case to which considerable at...